On Object Calculus with Algebraic Rewriting
نویسندگان
چکیده
In trying to use Abadi and Cardelli's object calculi as a foundation for a programming language the addition of algebraic data types arises naturally. This paper deenes such an extension, shows a motivating example, and explores the new calculi by establishing properties such as Church-Rosser, subject reduction and uniqueness of types.
منابع مشابه
A Calculus of Transformation
This paper presents the concepts and the semantics of a transformation calculus TC that is generic w.r.t. concrete object languages (see also [WS 94]). Built upon an object language description given by an algebraic specification, TC provides context-sensitive rules in which requirements can be imposed on the context of a redex, and integrates a restricted form of extended rewriting (see [DJ 90...
متن کاملConfluence via strong normalisation in an algebraic lambda-calculus with rewriting
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear...
متن کاملCall-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
We examine the relationship between the algebraic λ-calculus, a fragment of the differential λ-calculus and the linear-algebraic λ-calculus, a candidate λ-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalarmultiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using ...
متن کاملOn the confluence of λ-calculus with conditional rewriting
The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کامل